Efficient Tag Path Authentication Protocol with Less Tag Memory

نویسندگان

  • Hongbing Wang
  • Yingjiu Li
  • Zongyang Zhang
  • Yunlei Zhao
چکیده

Logistical management has been advanced rapidly in these years, taking advantage of the broad connectivity of the Internet. As it becomes an important part of our lives, it also raises many challenging issues, e.g., the counterfeits of expensive goods pose a serious threat to supply chain management. As a result, path authentication becomes especially important in supply chain management, as it helps us maintain object pedigree and supply chain integrity. Meanwhile, a tag path authentication must meet a series of security requirements, such as authentication, privacy, and unlinkability. In addition, the authentication protocol must be efficient. In 2011, the first tag path authentication protocol in an RFID-based supply chain, named “Tracke”, is proposed by Blass et al. in NDSS’11. They have made an important breakthrough in this research area. In this paper, we improve their work and propose a more efficient tag path authentication protocol in an RFID-based supply chain, which meets all the above mentioned security requirements. Our result shows that the proposed protocol can significantly reduce both computational overhead and memory requirement on tags, compared with the previous work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secure and Efficient Tag Searching in RFID Systems using Serverless Search Protocol

In the coming pervasive society, Radio Frequency Identification(RFID) Tags will be affixed within every product and object including human. This technology is anticipated to be a major technology which will be utilized by several pervasive services where these tags will be used to identify various objects. However, the use of RFID tags may create new threats to the security and privacy of indiv...

متن کامل

An Almost-Optimal Forward-Private RFID Mutual Authentication Protocol with Tag Control

In this paper we propose an efficient forward-private RFID mutual authentication protocol. The protocol is secure under standard assumptions. It builds over a recent work, extends it to achieve mutual authentication, and improves it by introducing a resynchronization mechanism between tag and reader, through which the server-side computation from O(Nω) is reduced to O(N + ω), where N is the tot...

متن کامل

An Efficient Authentication and Key Agreement Protocol in RFID System

Due to the very limited computing resource, storing space and electric power supply of tag, it is a great challenge for us to design a practical RFID protocol which is security, efficient and can be used in the low-cost tag. In 2007, He et al. proposed an authentication and key agreement protocol which is used in the process of communication between the low-cost tag and reader. They also proved...

متن کامل

A Study for the Convictional Authentication of EPC Global Class-1 Generation-2

Epcglobal class-1 generation-2 has been approved by the ISO18000-6C for the global usage. Here the tag can be traceable and that is transmitted into the plain text . In traditional encryption methods we use symmetric or asymmetric ciphers but this encryption methods are not suitable for the RFID tags. Gen2 has proposed some lightweight authentication protocols. Here message flow in RFID tag is ...

متن کامل

A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions

Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purposes. Distance bounding protocols are particularly designed as a countermeasure against these attacks. These protocols aim to ensure that the tags are in a distant area by measuring the round-trip delays during a rapid challenge-res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016